Parallel biomolecular simulation: Theory, algorithms and implementation
نویسندگان
چکیده
The essential goal of this work is the unified treatment of quantum mechanical and classical degrees of freedom in biomolecular simulation on all three levels: Theory, algorithms and implementation. In theory this is done within the framework of the Lagrangian model, which handles electronic coordinates and Cartesian nuclear coordinates in a consistent way. Furthermore, there is a 1:l correspondence between the various algorithmic substeps of selfconsistent-force molecular dynamics (SCF-MD) and classical molecular dynamics (CMD): The overlap criterion corresponds to the cut-off principle, the list of integrals to the pairlist and the computation of interaction matrix elements to the computation of pair forces. (The integration step is identical in both schemes.) This complete analogy can be conserved on the implementation level, for which actual benchmarks on three common architectures are given for a CMD simulation of the hydrated protein ubiquitin.
منابع مشابه
Implementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملGROMACS 4: Algorithms for Highly Efficient, Load-Balanced, and Scalable Molecular Simulation.
Molecular simulation is an extremely useful, but computationally very expensive tool for studies of chemical and biomolecular systems. Here, we present a new implementation of our molecular simulation toolkit GROMACS which now both achieves extremely high performance on single processors from algorithmic optimizations and hand-coded routines and simultaneously scales very well on parallel machi...
متن کاملHigh Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation
Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...
متن کاملParallel Biomolecular Simulation: An Overview and Analysis of Important Algorithms
Molecular Dynamics (MD) delivers dynamical information for large biomolecular systems using enormous CPU-resources. Consequently, several implementations of parallel MD programs have been presented. 1-13 We will analyse the characteristics of MD simulations of real-live biomolecular systems, summarise the serial algorithms tha t have been developed to significantly speed up these simulations an...
متن کاملHigh Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation
Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Simul. Pr. Theory
دوره 5 شماره
صفحات -
تاریخ انتشار 1997